Network flow methods for the minimum covariate imbalance problem

نویسندگان

چکیده

In an observational study, one is given disjoint samples of treatment units and control (untreated) units, the goal to compare outcomes between two in order estimate a effect. A complication that often differ on important pre-treatment attributes, these differences, referred as covariate imbalance, can bias estimate. One method correct for imbalance select subset sample has minimum with respect sample, then use this estimating While optimization problem NP-hard general, certain special cases be solved efficiently. Specifically, variant easy solve, three or more covariates NP-hard, solvable polynomial time. We present several network flow formulations minimizing nominal covariates. First, we cost formulation solving constraint must have same size sample. derive improved maximum formulation. For alternate restrictions subset, proportional objective which leads non-integral supplies demands preceding formulations. ensures integrality solves

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fuzzy Random Minimum Cost Network Flow Programming Problem

In this paper, a fuzzy random minimum cost flow problem is presented. In this problem, cost parameters and decision variables are fuzzy random variables and fuzzy numbers respectively. The object of the problem is to find optimal flows of a capacitated network. Then, two algorithms are developed to solve the problem based on Er-expected value of fuzzy random variables and chance-constrained pro...

متن کامل

The Minimum Universal Cost Flow in an Infeasible Flow Network

In this paper the concept of the Minimum Universal Cost Flow (MUCF) for an infeasible flow network is introduced. A new mathematical model in which the objective function includes the total costs of changing arc capacities and sending flow is built and analyzed. A polynomial time algorithm is presented to find the MUCF.

متن کامل

Relaxation Methods for Minimum Cost Network Flow

We view the optimal single commodity network flow problem with linear arc costs and its dual as a pair of monotropic programming problems, i.e. problems of minimizing the separable sum of scalar extended real-valued convex functions over a subspace. For such problems directions of cost improvement can be selected from among a finite set of directions--the elementary vectors of the constraint su...

متن کامل

the algorithm for solving the inverse numerical range problem

برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.

15 صفحه اول

Parallel primal-dual methods for the minimum cost flow problem

In this paper we discuss the parallel asynchronous implementation of the classical primaldual method for solving the linear minimum cost network flow problem. Multiple augmentations and price rises are simultaneously attempted starting from several nodes with possibly outdated price and flow information. The results are then merged asynchronously subject to rather weak compatibility conditions....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: European Journal of Operational Research

سال: 2022

ISSN: ['1872-6860', '0377-2217']

DOI: https://doi.org/10.1016/j.ejor.2021.10.041